Iterative Pattern Matching using K- nn and Lazy Bayesian Rule

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Heuristic Lazy Bayesian Rule Algorithm

LBR has demonstrated outstanding classification accuracy. However, it has high computational overheads when large numbers of instances are classified from a single training set. We compare LBR and the tree-augmented Bayesian classifier, and present a new heuristic LBR classifier that combines elements of the two. It requires less computation than LBR, but demonstrates similar prediction accuracy.

متن کامل

Lazy AC-Pattern Matching for Rewriting

We define a lazy pattern-matching mechanism modulo associativity and commutativity. The solutions of a pattern-matching problem are stored in a lazy list composed of a first substitution at the head and a non-evaluated object that encodes the remaining computations. We integrate the lazy AC-matching in a strategy language: rewriting rule and strategy application produce a lazy list of terms.

متن کامل

k-Abelian Pattern Matching

Two words are called k-abelian equivalent, if they share the same multiplicities for all factors of length at most k. We present an optimal linear time algorithm for identifying all occurrences of factors in a text that are k-abelian equivalent to some pattern P . Moreover, an optimal algorithm for finding the largest k for which two words are k-abelian equivalent is given. Solutions for online...

متن کامل

An evidence-theoretic k-NN rule with parameter optimization

This paper presents a learning procedure for optimizing the parameters in the evidence theoretic k nearest neighbor rule a pattern classi cation method based on the Dem pster Shafer theory of belief functions In this approach each neighbor of a pattern to be classi ed is considered as an item of evidence supporting certain hypotheses concerning the class membership of that pattern Based on this...

متن کامل

A learning scheme for a fuzzy k-NN rule

The performance of a fuzzy k-NN rule depends on the number k and a fuzzy membership-array W[I, mR], where l and m R denote the number of classes and the number of elements in the reference set X R respectively. The proposed learning procedure consists in iterative finding such k and W which minimize the error rate estimated by the 'leaving one out' method.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computer Applications

سال: 2015

ISSN: 0975-8887

DOI: 10.5120/20699-3298